Speeding Up Neighbour-Joining Tree Construction

نویسندگان

  • Gerth Stølting Brodal
  • Rolf Fagerberg
  • Thomas Mailund
  • Christian N. S. Pedersen
  • Derek Phillips
چکیده

A widely used method for constructing phylogenetic trees is the neighbour-joining method of Saitou and Nei. We develope heuristics for speeding up the neighbour-joining method which generate the same phylogenetic trees as the original method. All heuristics are based on using a quad-tree to guide the search for the next pair of nodes to join, but differ in the information stored in quad-tree nodes, the way the search is performed, and in the way the quad-tree is updated after a join. We empirically evaluate the performance of the heuristics on distance matrices obtained from the Pfam collection of alignments, and compare the running time with that of the QuickTree tool, a well-known and widely used implementation of the standard neighbour-joining method. The results show that the presented heuristics can give a significant speed-up over the standard neighbour-joining method, already for medium sized instances.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

QuickJoin - fast neighbour-joining tree reconstruction

We have built a tool for fast construction of very large phylogenetic trees. The tool uses heuristics for speeding up the neighbour-joining algorithm-while still constructing the same tree as the original neighbour-joining algorithm-making it possible to construct trees for 8000 species in <10 min on a single desktop PC. In comparison, the same task takes more than 30 min using the QuickTree ne...

متن کامل

Heuristics for Speeding Up Neighbour Joining

The neighbour joining method is a distance based method for constructing evolutionary trees [2]. Conceptually, it starts out with a star-formed graph where each leaf corresponds to a species, and iteratively picks two nodes adjacent to the root and joins them, by inserting a new node between the root and the two selected nodes. When joining nodes, the method selects the node pair i; j that mini...

متن کامل

RBT - a tool for building refined Buneman trees

SUMMARY We have developed a tool implementing an efficient algorithm for refined Buneman tree reconstruction. The algorithm--which has the same complexity as the neighbour-joining method and the (plain) Buneman tree construction--enables refined Buneman tree reconstruction on large taxa sets. AVAILABILITY The source code for RBT, written in Java, is available under the GNU Public License (GPL...

متن کامل

Phylogenetic analysis using complete signature information of whole genomes and clustered Neighbour-Joining method

A new method called Complete Composition Vector (CCV), which is a collection of Composition Vectors (CV), is described to infer evolutionary relationships between species using their complete genomic sequences. Such a method bypasses the complexity of performing multiple sequence alignments and avoids the ambiguity of choosing individual genes for species tree construction. It is expected to ef...

متن کامل

Fine Grain Parallel Construction of Neighbour-joining Phylogenetic Trees with Reduced Redundancy Using Multithreading

In biological research, scientists often need to use the information of the species to infer the evolutionary relationship among them. The evolutionary relationships are generally represented by a labeled binary tree, called the evolutionary tree (or phylogenetic tree). The phylogeny problem is computationally intensive, and thus it is suitable for parallel computing environment. In this paper,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003